Discovering branching and fractional dependencies in databases
نویسنده
چکیده
Article history: Received 18 October 2007 Received in revised form 25 March 2008 Accepted 3 April 2008 Available online 12 April 2008
منابع مشابه
Discovery of Data Dependencies in Relational Databases
Since real world databases are known to be very large, they raise problems of the access. Therefore, real world databases onlycan be accessed by database management systems and the number of accesses has to be reduced to a minimum. Considering this property, we are forced to use standard set–oriented interfaces of relational database management systems. We present a system for discovering data ...
متن کاملDiscovery of Data Dependencies in Relational Databases Lss8 Report 14 Discovery of Data Dependencies in Relational Databases Lss8 Report 14
Knowledge discovery in databases is not only the nontrivial extraction of implicit, previously unknown and potentially useful information from databases. We argue that in contrast to machine learning, knowledge discovery in databases should be applied to real world databases. Since real world databases are known to be very large, they raise problems of the access. Therefore, real world database...
متن کاملEfficient Discovery of Functional Dependencies and Armstrong Relations
In this paper, we propose a new efficient algorithm called Dep-Miner for discovering minimal non-trivial functional dependencies from large databases. Based on theoretical foundations, our approach combines the discovery of functional dependencies along with the construction of real-world Armstrong relations (without additional execution time). These relations are small Armstrong relations taki...
متن کاملFractional Poisson Process
For almost two centuries, Poisson process with memoryless property of corresponding exponential distribution served as the simplest, and yet one of the most important stochastic models. On the other hand, there are many processes that exhibit long memory (e.g., network traffic and other complex systems). It would be useful if one could generalize the standard Poisson process to include these p...
متن کاملMining Functional Dependency from Relational Databases Using Equivalent Classes and Minimal Cover
Data Mining (DM) represents the process of extracting interesting and previously unknown knowledge from data. This study proposes a new algorithm called FD_Discover for discovering Functional Dependencies (FDs) from databases. This algorithm employs some concepts from relational databases design theory specifically the concepts of equivalences and the minimal cover. It has resulted in large imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Data Knowl. Eng.
دوره 66 شماره
صفحات -
تاریخ انتشار 2008